Rigorous Bounds to Retarded Learning
نویسندگان
چکیده
منابع مشابه
Retarded learning: rigorous results from statistical mechanics.
We study learning of probability distributions characterized by an unknown symmetry direction. Based on an entropic performance measure and the variational method of statistical mechanics we develop exact upper and lower bounds on the scaled critical number of examples below which learning of the direction is impossible. The asymptotic tightness of the bounds suggests an asymptotically optimal ...
متن کاملOn rigorous upper bounds to a global optimum
In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is important for the overall efficiency of the branch and bound process. Software to find local optimizers, using floating point arithmetic, often computes an approximately feasible point close to an actual global optimizer. Not mathematically rigorous algorithms can simply evaluate the ...
متن کاملComputing Rigorous Bounds to the Accuracy of Calibrated Stereo Reconstruction
We deal with the problem of computing rigorous bounds to the position of 3-D points obtained by stereo triangulation when both the camera matrix and the coordinates of image points are affected by measurement errors. By “rigorous bounds” we mean that the true unknown 3-D points are guaranteed to lie within the intervals computed by our method with mathematical certainty. To this end, we first m...
متن کاملRigorous bounds for optimal dynamical decoupling
We present rigorous performance bounds for the optimal dynamical decoupling pulse sequence protecting a quantum bit (qubit) against pure dephasing. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We show that if the total sequence time is fixed...
متن کاملRigorous Perturbation Bounds of Some Matrix Factorizations
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The considered componentwise perturbations have the form of backward rounding errors for the standard factorization algorithms. The used approach is a combination of the classic and refined matrix equation approaches. Each of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2002
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.88.099801